#pragma GCC optimize(2)
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
#define pi acos(-1.0)
#define e exp(1.0)
const ll maxn=1e7+7;
const ll Mod=1e9+7;
ll N;
ll Quick_Mod(ll a,ll b){
	ll res=1;
	while(b){
		if(b&1){
			res=res*a%Mod;
		}
		a=a*a%Mod;
		b>>=1;
	}
	return res;
}
int main()
{
//  freopen(".../.txt","w",stdout);
	ios::sync_with_stdio(false);
	cin>>N;
	ll i,j,mul=1;
	for(i=N+1;i;i--){
		mul=mul*i%Mod;
	}
	ll res=Quick_Mod(2,N)*Quick_Mod(mul,Mod-2)%Mod;
	cout<<res<<endl;
	return 0;
}
